Signed Lp-distance fields

نویسندگان

  • Alexander G. Belyaev
  • Pierre-Alain Fayolle
  • Alexander A. Pasko
چکیده

We introduce and study a family of generalized double-layer potentials which are used to build smooth and accurate approximants for the signed distance function. Given a surface, the value of an approximant at a given point is a power mean of distances from the point to the surface points parameterized by the angle they are viewed from the given point. We analyze mathematical properties of the potentials and corresponding approximants. In particular, approximation accuracy estimates are derived. Our theoretical results are supported by numerical experiments which reveal high practical potential of our approach.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Interactive Ray-tracing Based on OptiX to Visualize Signed Distance Fields

We propose a parallel ray-tracing technique to visualize signed distance fields generated from triangular meshes based on NVIDIA OptiX. Our method visualizes signed distance fields with various distance offset values at interactive rates (2–12 fps). Our method utilizes a parallel kd-tree implementation to query the nearest triangle and the sphere tracing method to visualize the implicit surface.

متن کامل

Signed distance fields for polygon soup meshes

Many meshes in computer animation practice are meant to approximate solid objects, but the provided triangular geometry is often unoriented, non-manifold or contains self-intersections, causing inside/outside of objects to be mathematically ill-defined. We describe a robust and efficient automatic approach to define and compute a signed distance field for arbitrary triangular geometry. Starting...

متن کامل

Continuous Collision Detection Between Points and Signed Distance Fields

We present an algorithm for fast continuous collision detection between points and signed distance fields. Such robust queries are often needed in computer animation, haptics and virtual reality applications, but have so far only been investigated for polygon (triangular) geometry representations. We demonstrate how to use an octree subdivision of the distance field for fast traversal of distan...

متن کامل

Piecewise Linear Approximation of Signed Distance Fields

The signed distance field of a surface can effectively support many geometry processing tasks such as decimation, smoothing, and Boolean operations since it provides efficient access to distance (error) estimates. In this paper we present an algorithm to compute a piecewise linear, not necessarily continuous approximation of the signed distance field for a given object. Our approach is based on...

متن کامل

TESTING STATISTICAL HYPOTHESES UNDER FUZZY DATA AND BASED ON A NEW SIGNED DISTANCE

This paper deals with the problem of testing statisticalhypotheses when the available data are fuzzy. In this approach, wefirst obtain a fuzzy test statistic based on fuzzy data, and then,based on a new signed distance between fuzzy numbers, we introducea new decision rule to accept/reject the hypothesis of interest.The proposed approach is investigated for two cases: the casewithout nuisance p...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Computer-Aided Design

دوره 45  شماره 

صفحات  -

تاریخ انتشار 2013